19 research outputs found
A Minimal Nonfinitely Based Semigroup Whose Variety is Polynomially Recognizable
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm. © 2011 Springer Science+Business Media, Inc.Acknowledgement. The first and the second authors acknowledge support from the Federal Education Agency of Russia, project 2.1.1/3537, and from the Russian Foundation for Basic Research, grant 09-01-12142
Minsky machines and algorithmic problems
This is a survey of using Minsky machines to study algorithmic problems in
semigroups, groups and other algebraic systems.Comment: 19 page
Electrodepositionof nanocrystalline Ni–Re alloy coatings
Electrochemical processe
Some Conditions Related to the Exactness of Rees–Sushkevich Varieties
This article presents some conditions, expressed in terms of the inclusion and exclusion of certain small semigroups, that are related to a Rees–Sushkevich variety being generated by completely 0-simple or completely simple semigroups